for _ in range(int(input())):
n, m = list(map(int, input().split(' ')))
if 1 in [n, m] or n == m == 2:
print('YES')
else:
print('NO')
#include<bits/stdc++.h>
using namespace std;
int main (){
long long int n,p,k,j,x,y;
int t,a[1000],i;
cin>>t;
for(i=0;i<t;++i){
cin>>x>>y;
if((x==1)||(y==1)){a[i]=1; }
else if(x==2){if(y<=2){a[i]=1; }else{a[i]=0; } }
else if(y==2){if(x<=2){a[i]=1; }else{a[i]=0; } }
else{a[i]=0; } }
for(i=0;i<t;++i){if(a[i]==1){cout<<"YES"<<endl; } else{cout<<"NO"<<endl; } }
}
1516A - Tit for Tat | 622. Design Circular Queue |
814. Binary Tree Pruning | 791. Custom Sort String |
787. Cheapest Flights Within K Stops | 779. K-th Symbol in Grammar |
701. Insert into a Binary Search Tree | 429. N-ary Tree Level Order Traversal |
739. Daily Temperatures | 647. Palindromic Substrings |
583. Delete Operation for Two Strings | 518. Coin Change 2 |
516. Longest Palindromic Subsequence | 468. Validate IP Address |
450. Delete Node in a BST | 445. Add Two Numbers II |
442. Find All Duplicates in an Array | 437. Path Sum III |
436. Find Right Interval | 435. Non-overlapping Intervals |
406. Queue Reconstruction by Height | 380. Insert Delete GetRandom O(1) |
332. Reconstruct Itinerary | 368. Largest Divisible Subset |
377. Combination Sum IV | 322. Coin Change |
307. Range Sum Query - Mutable | 287. Find the Duplicate Number |
279. Perfect Squares | 275. H-Index II |